The algorithm by schwartz, sharir and collins on the piano mover's problem
Identifieur interne : 00E036 ( Main/Exploration ); précédent : 00E035; suivant : 00E037The algorithm by schwartz, sharir and collins on the piano mover's problem
Auteurs : Joël Marchand [France, Burundi]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: A presentation of the quantifier elimination problem, and other problems connected to it, such as the "piano mover's problem", is followed by the state of the art on the question. Afterwards are explained Schwartz', Sharir's and Collins' algorithm, based on the cylindrical algebraic decomposition, and two applications to bring out its possibilities and limitations. The tracks and views of development in this research domain, which is a useful tool for algebraic geometry, are lastly indicated. Its limitation, due to a very high cost, is an actual obstacle, which is to be removed, for its use for many classes of concrete geometric and algebraic problems.
Url:
DOI: 10.1007/3-540-51683-2_24
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002E77
- to stream Istex, to step Curation: 002E39
- to stream Istex, to step Checkpoint: 003320
- to stream Main, to step Merge: 00E919
- to stream Main, to step Curation: 00E036
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">The algorithm by schwartz, sharir and collins on the piano mover's problem</title><author><name sortKey="Marchand, Joel" sort="Marchand, Joel" uniqKey="Marchand J" first="Joël" last="Marchand">Joël Marchand</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:C52D5C1576A4C872C1AA53DF20E3A70DA49C77B1</idno><date when="1989" year="1989">1989</date><idno type="doi">10.1007/3-540-51683-2_24</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-0XNCN3SF-1/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002E77</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002E77</idno><idno type="wicri:Area/Istex/Curation">002E39</idno><idno type="wicri:Area/Istex/Checkpoint">003320</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">003320</idno><idno type="wicri:doubleKey">0302-9743:1989:Marchand J:the:algorithm:by</idno><idno type="wicri:Area/Main/Merge">00E919</idno><idno type="wicri:Area/Main/Curation">00E036</idno><idno type="wicri:Area/Main/Exploration">00E036</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">The algorithm by schwartz, sharir and collins on the piano mover's problem</title><author><name sortKey="Marchand, Joel" sort="Marchand, Joel" uniqKey="Marchand J" first="Joël" last="Marchand">Joël Marchand</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>Laboratorie L.I.T.P. / GRECO de Calcul Formel, Université Pierre et Marie Curie Paris VI, 4 Place Jussieu, 75252, Paris Cedex 05</wicri:regionArea><placeName><region type="region" nuts="2">Île-de-France</region><settlement type="city">Paris</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Burundi</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><title level="s" type="abbrev">Lect Notes Comput Sci</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: A presentation of the quantifier elimination problem, and other problems connected to it, such as the "piano mover's problem", is followed by the state of the art on the question. Afterwards are explained Schwartz', Sharir's and Collins' algorithm, based on the cylindrical algebraic decomposition, and two applications to bring out its possibilities and limitations. The tracks and views of development in this research domain, which is a useful tool for algebraic geometry, are lastly indicated. Its limitation, due to a very high cost, is an actual obstacle, which is to be removed, for its use for many classes of concrete geometric and algebraic problems.</div></front></TEI><affiliations><list><country><li>Burundi</li><li>France</li></country><region><li>Île-de-France</li></region><settlement><li>Paris</li></settlement></list><tree><country name="France"><region name="Île-de-France"><name sortKey="Marchand, Joel" sort="Marchand, Joel" uniqKey="Marchand J" first="Joël" last="Marchand">Joël Marchand</name></region></country><country name="Burundi"><noRegion><name sortKey="Marchand, Joel" sort="Marchand, Joel" uniqKey="Marchand J" first="Joël" last="Marchand">Joël Marchand</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00E036 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00E036 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:C52D5C1576A4C872C1AA53DF20E3A70DA49C77B1
|texte= The algorithm by schwartz, sharir and collins on the piano mover's problem
}}
| This area was generated with Dilib version V0.6.33. |  |